Committee polyhedral separability: complexity and polynomial approximation
نویسندگان
چکیده
منابع مشابه
Complexity and Approximability of Committee Polyhedral Separability of Sets in General Position
It is known that the minimum affine separating committee (MASC) combinatorial optimization problem, which is related to some machine learning techniques, is NP-hard and does not belong to Apx class unless P = NP . In this paper, it is shown that the MASC problem formulated in a fixed dimension space within n > 1 is intractable even if sets defining an instance of the problem are in general posi...
متن کاملOn the Complexity of Polyhedral Separability
It is NP complete to recognize whether two sets of points in general space can be separated by two hyperplanes It is NP complete to recognize whether two sets of points in the plane can be separated with k lines For every xed k in any xed dimension it takes polynomial time to recognize whether two sets of points can be separated with k hyperplanes
متن کاملPolynomial Time Approximation Schemes and Parameterized Complexity
In this paper, we study the relationship between the approximability and the parameterized complexity of NP optimization problems. We introduce a notion of polynomial fixed-parameter tractability and prove that, under a very general constraint, an NP optimization problem has a fully polynomial time approximation scheme if and only if the problem is polynomial fixed-parameter tractable. By enfor...
متن کاملComplexity and approximation ratio of semitotal domination in graphs
A set $S subseteq V(G)$ is a semitotal dominating set of a graph $G$ if it is a dominating set of $G$ andevery vertex in $S$ is within distance 2 of another vertex of $S$. Thesemitotal domination number $gamma_{t2}(G)$ is the minimumcardinality of a semitotal dominating set of $G$.We show that the semitotal domination problem isAPX-complete for bounded-degree graphs, and the semitotal dominatio...
متن کاملOn the Complexity of Lattice Problems with Polynomial Approximation Factors
Lattice problems are known to be hard to approximate to within sub-polynomial factors. For larger approximation factors, such as √ n, lattice problems are known to be in complexity classes such as NP∩ coNP and are hence unlikely to be NP-hard. Here we survey known results in this area. We also discuss some related zero-knowledge protocols for lattice problems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Machine Learning
سال: 2015
ISSN: 0885-6125,1573-0565
DOI: 10.1007/s10994-015-5505-0